From Kleene Algebra to Refinement Algebra
نویسنده
چکیده
KAT (Kleene Algebra with Tests) have proved to be useful for reasoning about programs in a partial correctness framework. We describe DRA (demonic Re nement Algebra), a variation of KAT for total correctness and illustrate its modeling and reasoning power with a number of applications and examples. TUCS Laboratory TUCS Learning and Reasoning Laboratory
منابع مشابه
Program Construction and Verification Components Based on Kleene Algebra
Variants of Kleene algebra support program construction and verification by algebraic reasoning. This entry provides a verification component for Hoare logic based on Kleene algebra with tests, verification components for weakest preconditions and strongest postconditions based on Kleene algebra with domain and a component for step-wise refinement based on refinement Kleene algebra with tests. ...
متن کاملProbabilistic Demonic Refinement Algebra
We propose an abstract algebra for reasoning about probabilistic programs in a total-correctness framework. In contrast to probablisitic Kleene algebra it allows genuine reasoning about total correctness and in addition to Kleene star also has a strong iteration operator. We define operators that determine whether a program is enabled, has certain failure or does not have certain failure, respe...
متن کاملAlgebras for Program Correctness in Isabelle/HOL
We present a reference formalisation of Kleene algebra and demonic refinement algebra with tests in Isabelle/HOL. It provides three different formalisations of tests. Our structured comprehensive libraries for these algebras extend an existing Kleene algebra library. It includes an algebraic account of Hoare logic for partial correctness and several refinement and concurrency control laws in a ...
متن کاملOn the Structure of Demonic Refinement Algebras
The main result of this report is that every demonic refinement algebra with enabledness and termination is isomorphic to an algebra of ordered pairs of elements of a Kleene algebra with domain and with a divergence operator satisfying a mild condition. Divergence is an operator producing a test interpreted as the set of states from which nontermination may occur.
متن کاملKleene getting lazy
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of composition. This allows the subsumption of Dijkstra’s computation calculus, Cohen’s omega algebra and von Wright’s demonic refinement algebra. Moreover, by adding domain and codomain operators we can also incorporate modal operators. We show that predicate transformers form lazy Kleene algebras, the d...
متن کامل